The Extremal Functions for Triangle-free Graphs with Excluded Minors
نویسندگان
چکیده
We prove two results: 1. A graph G on at least seven vertices with a vertex v such that G − v is planar and t triangles satisfies |E(G)| ≤ 3|V (G)| − 9 + t/3. 2. For p = 2, 3, . . . , 9, a triangle-free graph G on at least 2p − 5 vertices with no Kp-minor satisfies |E(G)| ≤ (p− 2)|V (G)| − (p− 2).
منابع مشابه
Interval minors of complete bipartite graphs
Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in Kr,s-interval minor free bipartite graphs. We determine exact values when r = 2 and describe the extremal graphs. For r = 3, lower and upper bounds are given and the structure of K3,s-interval minor free graphs is studied.
متن کاملThe Colin de Verdière parameter, excluded minors, and the spectral radius
In this paper we characterize graphs which maximize the spectral radius of their adjacency matrix over all graphs of Colin de Verdière parameter at most m. We also characterize graphs of maximum spectral radius with no H as a minor when H is either Kr or Ks,t. Interestingly, the extremal graphs match those which maximize the number of edges over all graphs with no H as a minor when r and s are ...
متن کاملRooted induced trees in triangle-free graphs
For a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G that is a tree. Further, for a vertex v ∈ V (G), let t(G, v) denote the maximum number of vertices in an induced subgraph of G that is a tree, with the extra condition that the tree must contain v. The minimum of t(G) (t(G, v), respectively) over all connected triangle-free graphs G (and vertices v ∈ V (G)...
متن کاملOn the number of pentagons in triangle-free graphs
Using the formalism of flag algebras, we prove that the maximal number of copies of C5 in a triangle-free graph with 5l + a vertices (0 ≤ a ≤ 4) is l(l + 1)a, and we show that the set of extremal graphs for this problem consists precisely of almost balanced blow-ups of a single pentagon. This settles a conjecture made by Erdős in 1984. For the transition from an asymptotic version of our result...
متن کاملEfficient Removal without Efficient Regularity
Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured. For example, triangle-free graphs might have only regular partitions (in the sense of Szemerédi) of tower-type size. And indeed, essentially all the graph p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018